Universal Codes as a Basis for Time Series Testing

نویسندگان

  • Boris Ryabko
  • Jaakko Astola
چکیده

We suggest a new approach to hypothesis testing for ergodic and stationary processes. In contrast to standard methods, the suggested approach gives a possibility to make tests, based on any lossless data compression method even if the distribution law of the codeword lengths is not known. We apply this approach to the following four problems: goodness-oft testing (or identity testing), testing for independence, testing of serial independence and homogeneity testing and suggest nonparametric statistical tests for these problems. It is important to note that practically used so-called archivers can be used for suggested testing. AMS subject classi cation: 60G10, 60J10, 62M02, 62M07, 94A29. keywords universal coding, data compression, hypothesis testing, nonparametric testing, Shannon entropy, stationary and ergodic source.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time series

We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypotheses testing in a framework of classical mathematical statistics. The methods for identity testing and nonparametric testing of serial independence for time series are suggested. AMS subject classification: 60G10, 62M07, 68Q30, 68W01, 94A29.

متن کامل

Application of Kolmogorov complexity and universal codes to identity testing and nonparametric testing of serial independence for time

We show that Kolmogorov complexity and such its estimators as universal codes (or data compression methods) can be applied for hypothesis testing in a framework of classical mathematical statistics. The methods for identity testing and nonparametric testing of serial independence for time series are described. AMS subject classification: 60G10, 62M07, 68Q30, 68W01, 94A29.

متن کامل

Applications of Universal Source Coding to Statistical Analysis of Time Series

We show how universal codes can be used for solving some of the most important statistical problems for time series. By definition, a universal code (or a universal lossless data compressor) can compress any sequence generated by a stationary and ergodic source asymptotically to the Shannon entropy, which, in turn, is the best achievable ratio for lossless data compressors. We consider finite-a...

متن کامل

Applications of Kolmogorov Complexity and Universal Codes to Nonparametric Estimation of Characteristics of Time Series

We consider finite-alphabet and real-valued time series and the following four problems: i) estimation of the (limiting) probability P (x0 . . . xs) for every s and each sequence x0 · · ·xs of letters from the process alphabet (or estimation of the density p(x0, . . . , xs) for real-valued time series), ii) the so-called on-line prediction, where the conditional probability P (xt+1|x1x2 . . . x...

متن کامل

Application of data compression methods to hypothesis testing for ergodic and stationary processes

We show that data compression methods (or universal codes) can be applied for hypotheses testing in a framework of classical mathematical statistics. Namely, we describe tests, which are based on data compression methods, for the three following problems: i) identity testing, ii) testing for independence and iii) testing of serial independence for time series. Applying our method of identity te...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/cs/0602084  شماره 

صفحات  -

تاریخ انتشار 2005